Hyper-systolic parallel computing
نویسندگان
چکیده
منابع مشابه
Hyper-Systolic Parallel Computing
A new class of parallel algorithms is introduced that can achieve a complexity of O(n 3 2 ) with respect to the interprocessor communication, in the exact computation of systems with pairwise mutual interactions of all elements. Hitherto, conventional methods exhibit a communicational complexity of O(n). The amount of computation operations is not altered for the new algorithm which can be form...
متن کاملHyper-Systolic Matrix Multiplication
A novel parallel algorithm for matrix multiplication is presented. The hyper-systolic algorithm makes use of a one-dimensional processor abstraction. The procedure can be implemented on all types of parallel systems. It can handle matrix-vector multiplications as well as transposed matrix products.
متن کاملGeneralized Hyper-Systolic Algorithm
We generalize the hyper-systolic algorithm proposed in [1] for abstract data structures on massive parallel computers with np processors. For a problem of size V the communication complexity of the hyper-systolic algorithm is proportional to √ npV , to be compared with npV for the systolic case. The implementation technique is explained in detail and the example of the parallel matrix-matrix mu...
متن کاملHyper-Systolic Routing for SIMD Systems
Massively parallel SIMD systems like the Italian supercomputer APE100/Quadrics[1] are very attractive for high performance computing applications as they offer a pathway to Teracomputing in the near future[2] at an affordable price. The 3-dimensional interprocessor network of the supercomputer APE100/Quadrics has been designed to carry out fast data movements in quantum chromodynamics calculati...
متن کاملComputing Wiener and hyper–Wiener indices of unitary Cayley graphs
The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy of unitary Cayley graphs is computed. In this paper the Wiener and hyperWiener index of Xn is computed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 1998
ISSN: 1045-9219
DOI: 10.1109/71.663861